Predicting Fault Prone Modules by the Dempster-Shafer Belief Networks
نویسندگان
چکیده
This paper describes a novel methodology for predicting fault prone modules. The methodology is based on Dempster-Shafer (D-S) belief networks. Our approach consists of three steps: First, building the Dempster-Shafer network by the induction algorithm; Second, selecting the predictors (attributes) by the logistic procedure; Third, feeding the predictors describing the modules of the current project into the inducted Dempster-Shafer network and identifying fault prone modules. We applied this methodology to a NASA dataset. The prediction accuracy of our methodology is higher than that achieved by logistic regression or discriminant analysis on the same dataset.
منابع مشابه
Evaluation of Classifiers in Software Fault-Proneness Prediction
Reliability of software counts on its fault-prone modules. This means that the less software consists of fault-prone units the more we may trust it. Therefore, if we are able to predict the number of fault-prone modules of software, it will be possible to judge the software reliability. In predicting software fault-prone modules, one of the contributing features is software metric by which one ...
متن کاملFault-Tolerant Interval Estimation Fusion By Dempster-Shafer Theory
Fault tolerance is an important issue in network design because sensor networks must work in a dynamic, uncertain situation. In this paper, using DempsterShafer theory of evidence, we propose several new faulttolerant interval integration functions, which give interval estimate fusion outputs and the corresponding belief levels, depending on prior information and practical requirements. Not onl...
متن کاملA Sensor-Based Scheme for Activity Recognition in Smart Homes using Dempster-Shafer Theory of Evidence
This paper proposes a scheme for activity recognition in sensor based smart homes using Dempster-Shafer theory of evidence. In this work, opinion owners and their belief masses are constructed from sensors and employed in a single-layered inference architecture. The belief masses are calculated using beta probability distribution function. The frames of opinion owners are derived automatically ...
متن کاملFast Markov Chain Algorithms for Calculating Dempster-Shafer Belief
We present a new type of Markov Chain algo rithm for the calculation of combined Dempster Shafer belief which is almost linear in the size of the frame thus making the calculation of belief feasible for a wider range of problems We also indicate how these algorithms may be used in the cal culation of belief in product spaces associated with networks
متن کاملIndependence, Conditionality and Structure of Dempster-Shafer Belief Functions
Several approaches of structuring (factorization, decomposition) of Dempster-Shafer joint belief functions from literature are reviewed with special emphasis on their capability to capture independence from the point of view of the claim that belief functions generalize bayes notion of probability. It is demonstrated that Zhu and Lee's {Zhu:93} logical networks and Smets' {Smets:93} directed ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proceedings. IEEE International Automated Software Engineering Conference
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003